An optimization problem on graphs
نویسندگان
چکیده
منابع مشابه
Using Interval Graphs in an Order Processing Optimization Problem
In this paper we address an order processing optimization problem known as minimization of open stacks (MOSP). We present an integer programming model, based on the existence of a perfect elimination scheme in interval graphs, which finds an optimal sequence for the costumers orders.
متن کاملAn Alexandroff topology on graphs
Let G = (V,E) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. In this paper, we associate a topology to G, called graphic topology of G and we show that it is an Alexandroff topology, i.e. a topology in which intersec- tion of every family of open sets is open. Then we investigate some properties of this topology. Our motivation is to give an e...
متن کاملOn an Optimization Problem in Sensor Selection*
We address the following sensor selection problem. We assume that a dynamic system possesses a certain property, call it Property D, when a set G of sensors is used. There is a cost c A associated with each set A of sensors that is a subset of G. Given any set of sensors that is a subset of G, it is possible to determine, via a test, whether the resulting system-sensor combination possesses Pro...
متن کاملAn optimization problem on the sphere
We prove existence and uniqueness of the minimizer for the average geodesic distance to the points of a geodesically convex set on the sphere. This implies a corresponding existence and uniqueness result for an optimal algorithm for halfspace learning, when data and target functions are drawn from the uniform distribution.
متن کاملOn An Optimization Problem in Robust Statistics
In this paper, we consider a large class of computational problems in robust statistics, which can be formulated as selection of optimal subsets of data based on some criterion function. To solve such problems, there are largely two classes of algorithms available in the literature. One is based on purely random search, and the other is based on deterministically guided strategies. Though these...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1986
ISSN: 0166-218X
DOI: 10.1016/0166-218x(86)90010-7